A problem concerning orthogonal trajectories

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Problem of Hering Concerning Orthogonal Covers of Kn

A Hering connguration of type k and order n is a factorization of the complete digraph ~ K n into n factors each of which consists of an isolated vertex and the edge-disjoint union of directed k-cycles, which has the additional property that for any pair of distinct factors say ~ G i and ~ G j there is precisely one pair of vertices, say fa; bg such that ~ G i contains the directed edge (a; b) ...

متن کامل

Approximate Hotspots of Orthogonal Trajectories

In this paper we study the problem of finding hotspots, i.e. regions in which a moving entity has spent a significant amount of time, for polygonal trajectories. The fastest optimal algorithm, due to Gudmundsson, van Kreveld, and Staals (2013) finds an axis-parallel square hotspot of fixed side length in O(n). Limiting ourselves to the case in which the entity moves in a direction parallel eith...

متن کامل

A Reflexivity Problem concerning The

Let X be a compact Hausdorff space and let H be a separable Hilbert space. We prove that the group of all order automorphisms of the C∗-algebra C(X)⊗ B(H) is algebraically reflexive.

متن کامل

A Problem Concerning a Character Sum

Williams' research was supported by NSERC of Canada grant A7649. 1991 Mathematics Subject Classi cation: 11Y40, 11Y99 Let p be a prime congruent to 1 modulo 4, n p the Legendre symbol and S(k) = Pp 1 n=1 n k n p . The problem of finding a prime p such that S(3) > 0 was one of the motivating forces behind the development of several of Shanks’ ideas for computing in algebraic number fields, altho...

متن کامل

A Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices

We give a simple proof that an n×n orthogonal matrix with n ≥ 2 which cannot be written as a direct sum has at least 4n− 4 nonzero entries. 1. The result. What is the least number of nonzero entries in a real orthogonal matrix of order n? Since the identity matrix In is orthogonal the answer is clearly n. A more interesting question is: what is the least number of nonzero entries in a real orth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1949

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/28066